Model Checking Paxos in Spin

Model Checking Paxos in Spin

We present a formal model of a distributed consensus algorithm in the executable specification language Promela extended with a new type of guards, called counting guards, needed to implement transitions that depend on majority voting. Our formalization exploits abstractions that follow from reduction theorems applied to the specific case-study. We apply the model checker Spin to automatically ...

Software model checking with SPIN

The aim of this chapter is to give an overview of the theoretical foundation and the practical application of logic model checking techniques for the verification of multi-threaded software (rather than hardware) systems. The treatment is focused on the logic model checker SPIN, which was designed for this specific domain of application. SPIN implements an automata-theoretic method of verificat...

CTL Model Checking for SPIN

We describe an e cient CTL model checking algorithm based on alternating automata and games. A CTL formula, expressing a correctness property, is rst translated to a hesitant alternating automaton and then composed with a Kripke structure representing the model to be checked, this resulting automaton is then checked for nonemptiness. We introduce the nonemptiness game that checks the nonemptine...

Distributed LTL Model-Checking in SPIN

Model Checking Agent Dialogues in SPIN

The theory of Multi-Agent Systems (MAS) is typically concerned with a definition of the rational processes within the agents, or the communicative processes between agents. In this paper we are primarily interested in the latter, and in particular the problem of ensuring the correctness of communication. We address the problem by applying model checking techniques to protocols which express int...